Construction and Count of Boolean Functions of an Odd Number of Variables with Maximum Algebraic Immunity
نویسندگان
چکیده
Algebraic immunity has been proposed as an important property of Boolean functions. To resist algebraic attack, a Boolean function should possess high algebraic immunity. It is well known now that the algebraic immunity of an n-variable Boolean function is upper bounded by ⌈ n 2 ⌉ . In this paper, for an odd integer n, we present a construction method which can efficiently generate a Boolean function of n variables with maximum algebraic immunity, and we also show that any such function can be generated by this method. Moreover, the number of such Boolean functions is greater than 22 n−1 .
منابع مشابه
Construction of Rotation Symmetric Boolean Functions with optimal Algebraic Immunity Construcción de Funciones Booleanas de Rotación Simétrica con Inmunidad Algebraica Óptima
In this paper, we present theoretical constructions of Rotation Symmetric Boolean Functions (RSBFs) on odd number of variables with the maximum possible algebraic immunity. To get high nonlinearity, we generalize our construction to a search technique in the RSBF class. We present RSBFs with the maximum algebraic immunity and high nonlinearity for odd number of variables. We also study the RSBF...
متن کاملOn the Boolean functions With Maximum Possible Algebraic Immunity : Construction and A Lower Bound of the Count
This paper gives a construction method which can get a large class of Boolean functions with maximum algebraic immunity(AI) from one such giving function. Our constructions get more functions than any previous construction. The cryptographic properties, such as balance, algebraic degree etc, of those functions are studied. It shows that we can construct Boolean functions with better cryptograph...
متن کاملConstruction of Rotation Symmetric Boolean Functions with Maximum Algebraic Immunity
In this paper we present a theoretical construction of Rotation Symmetric Boolean Functions (RSBFs) on odd number of variables with maximum possible AI and further these functions are not symmetric. Our RSBFs are of better nonlinearity than the existing theoretical constructions with maximum possible AI . To get very good nonlinearity, which is important for practical cryptographic design, we g...
متن کاملConstructing and Counting Even-Variable Symmetric Boolean Functions with Algebraic Immunity not Less Than $d$
In this paper, we explicitly construct a large class of symmetric Boolean functions on 2k variables with algebraic immunity not less than d, where integer k is given arbitrarily and d is a given suffix of k in binary representation. If let d = k, our constructed functions achieve the maximum algebraic immunity. Remarkably, 22 k⌋+2 symmetric Boolean functions on 2k variables with maximum algebra...
متن کاملConstruction and Analysis of Boolean Functions of 2t+1 Variables with Maximum Algebraic Immunity
In this paper, we study the construction of (2t+ 1)-variable Boolean functions with maximum algebraic immunity, and we also analyze some other cryptographic properties of this kind of functions, such as nonlinearity, resilience. We first identify several classes of this kind of functions. Further, some necessary conditions of this kind of functions which also have higher nonlinearity are obtain...
متن کامل